As early as the 16th century, Simon Jacob, a German reckoning master, noticed that the worst case in computing the greatest common divisor of two numbers by the Euclidean algorithm occurs if these numbers are equimultiples of two consecutive members of the Fibonacci sequence
We study the worst-case behavior of three iterative algorithms for computing the Jacobi symbol (vu)....
What has the theoretical breeding of rabbits got to do with geometry? The connection of the Fibona...
AbstractOn the basis of the Arabic text, we investigate how Thabit ibn Qurra (ninth century) could h...
As early as the 16th century, Simon Jacob, a German reckoning master, noticed that the worst case in...
The Euclidean algorithm for computing the greatest common divisor of two integers is, as D. E. Knuth...
International audienceemainder problems have a long tradition and were widely disseminated in books ...
AbstractThe first extensive definition and development of the arithmetical triangle are credited to ...
AbstractRemainder problems have a long tradition and were widely disseminated in books on calculatio...
The Euclidean algorithm for finding greatest common divisors, one of the oldest algorithms in the wo...
The Fibonacci numbers are familiar to all of us. They appear unexpectedly often in mathematics, so m...
AbstractAmong several treatments of circle quadrature known from the Middle Ages is one with the tit...
AbstractWe develop a general framework for the analysis of algorithms of a broad Euclidean type. The...
AbstractIn this paper I show how in 1743 A.-C. Clairaut applied an iterative method to calculate the...
Cette thèse essaie de reconstituer l’histoire de la réception du calcul leibnizien dans les milieux ...
This monograph presents a groundbreaking scholarly treatment of the German mathematician Jost Bürgi’...
We study the worst-case behavior of three iterative algorithms for computing the Jacobi symbol (vu)....
What has the theoretical breeding of rabbits got to do with geometry? The connection of the Fibona...
AbstractOn the basis of the Arabic text, we investigate how Thabit ibn Qurra (ninth century) could h...
As early as the 16th century, Simon Jacob, a German reckoning master, noticed that the worst case in...
The Euclidean algorithm for computing the greatest common divisor of two integers is, as D. E. Knuth...
International audienceemainder problems have a long tradition and were widely disseminated in books ...
AbstractThe first extensive definition and development of the arithmetical triangle are credited to ...
AbstractRemainder problems have a long tradition and were widely disseminated in books on calculatio...
The Euclidean algorithm for finding greatest common divisors, one of the oldest algorithms in the wo...
The Fibonacci numbers are familiar to all of us. They appear unexpectedly often in mathematics, so m...
AbstractAmong several treatments of circle quadrature known from the Middle Ages is one with the tit...
AbstractWe develop a general framework for the analysis of algorithms of a broad Euclidean type. The...
AbstractIn this paper I show how in 1743 A.-C. Clairaut applied an iterative method to calculate the...
Cette thèse essaie de reconstituer l’histoire de la réception du calcul leibnizien dans les milieux ...
This monograph presents a groundbreaking scholarly treatment of the German mathematician Jost Bürgi’...
We study the worst-case behavior of three iterative algorithms for computing the Jacobi symbol (vu)....
What has the theoretical breeding of rabbits got to do with geometry? The connection of the Fibona...
AbstractOn the basis of the Arabic text, we investigate how Thabit ibn Qurra (ninth century) could h...
DOI
Add to ORKG